Graph Transformation by Juan de Lara & Detlef Plump

Author:Juan de Lara & Detlef Plump
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

i.e., the host edge consumed next must either be an edge between the host node assigned to x and a node different from the ones assigned to x or y, or it must be a completely unrelated edge wrt. to the host nodes assigned to x or y, or all edges of the host edge have been completely consumed, indicated by .

For the second item, one can compute

i.e., the host edge under which the shift step is taken is an edge between the host node assigned to y and a node different from the ones assigned to x or y.

As is not in the edge under which the shift step is taken cannot be consumed next when the reduce step is taken instead. This condition is sufficient to avoid a conflict in parsing, but this is not the case for PSR parsing. Because host edges are not consumed in a fixed sequence, might be consumed later when the reduce step is taken. We must actually compute the set of all abstract literals that may follow immediately, or later in . Let us denote the set of all such abstract literals , whose computation from is straightforward. In this example, one can see that

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.